The Brownian Limit of Separable Permutations
نویسندگان
چکیده
Context of our work. Describing typical properties of permutations in a given class is a question that has received quite a lot of attention in the last few years. Most of the attention is focused on permutation classes Av(τ) for τ of size 3. See for instance the very precise description of the asymptotic shape of permutations in these classes by Miner and Pak [12], or the link between large random permutations in these classes and the Brownian excursion explained by Hoffman, Rizzolo and Slivken [5, 6]. Another
منابع مشابه
Patterns in Random Permutations Avoiding
We consider a random permutation drawn from the set of 132-avoiding permutations of length n and show that the number of occurrences of another pattern σ has a limit distribution, after scaling by n where λ(σ) is the length of σ plus the number of descents. The limit is not normal, and can be expressed as a functional of a Brownian excursion. Moments can be found by recursion.
متن کاملEquipopularity Classes in the Separable Permutations
When two patterns occur equally often in a set of permutations, we say that these patterns are equipopular. Using both structural and analytic tools, we classify the equipopular patterns in the set of separable permutations. In particular, we show that the number of equipopularity classes for length n patterns in the separable permutations is equal to the number of partitions of the integer n− 1.
متن کاملA bijection between permutations and floorplans, and its applications
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter permutations are classes of permutations that can be defined in terms of forbidden subsequences. It is known that the number of slicing floorplans equals the number of separable permutations and that the number of mosaic ...
متن کاملSubclasses of the Separable Permutations
The separable permutations are those that can be obtained from the trivial permutation by two operations called direct sum and skew sum. This class of permutations contains the class of stack sortable permutations,Avp231q, which are enumerated by the Catalan numbers. We prove that all subclasses of the separable permutations which do not contain Avp231q or a symmetry of this class have rational...
متن کاملSeparable d-Permutations and Guillotine Partitions
We characterize separable multidimensional permutations in terms of forbidden patterns and enumerate them by means of generating function, recursive formula, and explicit formula. We find a connection between multidimensional permutations and guillotine partitions of a box. In particular, a bijection between separable d-dimensional permutations and guillotine partitions of a 2d−1-dimensional bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016